Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(app(compose, f), g), x) → app(f, app(g, x))

Q is empty.


↳ QTRS
  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(app(compose, f), g), x) → app(f, app(g, x))

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(app(compose, f), g), x) → app(f, app(g, x))

The set Q consists of the following terms:

app(app(app(compose, x0), x1), x2)


Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP(app(app(compose, f), g), x) → APP(f, app(g, x))
APP(app(app(compose, f), g), x) → APP(g, x)

The TRS R consists of the following rules:

app(app(app(compose, f), g), x) → app(f, app(g, x))

The set Q consists of the following terms:

app(app(app(compose, x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(compose, f), g), x) → APP(f, app(g, x))
APP(app(app(compose, f), g), x) → APP(g, x)

The TRS R consists of the following rules:

app(app(app(compose, f), g), x) → app(f, app(g, x))

The set Q consists of the following terms:

app(app(app(compose, x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP(app(app(compose, f), g), x) → APP(f, app(g, x))
APP(app(app(compose, f), g), x) → APP(g, x)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
APP(x1, x2)  =  APP(x1)
app(x1, x2)  =  app(x1, x2)
compose  =  compose

Lexicographic path order with status [19].
Precedence:
trivial

Status:
APP1: [1]
app2: [2,1]
compose: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(app(compose, f), g), x) → app(f, app(g, x))

The set Q consists of the following terms:

app(app(app(compose, x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.